@book{Press:2007:NRE:1403886,
 author = {Press, William H. and Teukolsky, Saul A. and Vetterling, William T. and Flannery, Brian P.},
 title = {Numerical Recipes 3rd Edition: The Art of Scientific Computing},
 year = {2007},
 isbn = {0521880688, 9780521880688},
 edition = {3},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
} 

@article{Chretienne:2003:PSC:642013.642023,
 author = {Chr{\'e}tienne, Philippe and Sourd, Francis},
 title = {PERT scheduling with convex cost functions},
 journal = {Theor. Comput. Sci.},
 issue_date = {January 2003},
 volume = {292},
 number = {1},
 month = jan,
 year = {2003},
 issn = {0304-3975},
 pages = {145--164},
 numpages = {20},
 url = {http://dx.doi.org/10.1016/S0304-3975(01)00220-1},
 doi = {10.1016/S0304-3975(01)00220-1},
 acmid = {642023},
 publisher = {Elsevier Science Publishers Ltd.},
 address = {Essex, UK},
 keywords = {PERT scheduling, convex cost functions, deterministic, polynomial algorithm},
} 

@mastersthesis{planken08-mscthesis,
	author          = {Leon R. Planken},
	title           = {New Algorithms for the Simple Temporal Problem},
	school          = {Delft University of Technology},
	year            = {2008},
	month           = {January},
	tutor           = {Witteveen, C. and de Weerdt, M.M. and Heule, M.J.H. and de Ridder, D.},
	url             = {http://www.st.ewi.tudelft.nl/~planken/Papers/mscthesis.pdf},
	project         = {MaSTP},
	group           = {ALG}
}

@Article{dechtermeiripearl:ai:1991,
  author =	"Rina Dechter and Itay Meiri and Judea Pearl",
  title =	"Temporal constraint networks",
  journal =	"Artificial Intelligence",
  pages =	"61--95",
  volume =	"49",
  year = 	"1991",
}

@Article{Garey1988,
  author=	"Michael R. Garey, Robert E. Tarjan, Gordon T. Wilfong",
  title=	"One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties",
  journal=	"Mathematics o fOperations Research",
  pages=	"330--348",
  volume=	"13",
  year=		"1988",
}

@article{ROE:8227001,
author = {Chrétienne,Philippe},
title = {Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine},
journal = {RAIRO - Operations Research},
volume = {35},
issue = {02},
month = {4},
year = {2001},
issn = {1290-3868},
pages = {165--187},
numpages = {23},
doi = {10.1051/ro:2001110},
URL = {http://www.rairo-ro.org/action/article_S039905590100110X},
}

@article{Brucker19993,
title = "Resource-constrained project scheduling: Notation, classification, models, and methods ",
journal = "European Journal of Operational Research ",
volume = "112",
number = "1",
pages = "3 - 41",
year = "1999",
note = "",
issn = "0377-2217",
doi = "http://dx.doi.org/10.1016/S0377-2217(98)00204-5",
url = "http://www.sciencedirect.com/science/article/pii/S0377221798002045",
author = "Peter Brucker and Andreas Drexl and Rolf Möhring and Klaus Neumann and Erwin Pesch",
keywords = "Project scheduling/resource constraints",
keywords = "Notation",
keywords = "Classification scheme",
keywords = "Single-mode case",
keywords = "Time–cost tradeoffs",
keywords = "Multi-mode case",
keywords = "Minimum and maximum time lags",
keywords = "Nonregular objectives",
keywords = "Stochastic activity durations",
keywords = "Constraint propagation "
}

@article{Brucker199977,
title = "A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags ",
journal = "Discrete Applied Mathematics ",
volume = "94",
number = "1–3",
pages = "77 - 99",
year = "1999",
note = "Proceedings of the Third International Conference on Graphs and Optimization GO-III",
issn = "0166-218X",
doi = "http://dx.doi.org/10.1016/S0166-218X(99)00015-3",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X99000153",
author = "Peter Brucker and Thomas Hilbig and Johann Hurink",
keywords = "Time-lags",
keywords = "Branch and bound",
keywords = "Scheduling",
keywords = "Shop problems",
keywords = "Multi-purpose machines",
keywords = "Multi-processor tasks "
}

@misc{so30629,
          number = {1440},
          author = {J.L. {Hurink} and J. {Keuchel}},
          series = {Memorandum / University of Twente, Faculty of Applied Mathematics, ISSN 0921-1969 ; no. 1440},
            note = {Memorandum Faculteit TW, nr 1440},
         address = {Enschede},
           title = {Local search algorithms for a single-machine scheduling problem with positive and negative time-lags},
       publisher = {Universiteit Twente},
            year = {1998},
             url = {http://doc.utwente.nl/30629/},
}

